a stable coupled newton's iteration for the matrix inverse $p$-th root
Authors
abstract
the computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. it is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of new-ton's method, but previous researchers have mentioned that some iterations havepoor convergence and stability properties. in this work, a stable recursive techniqueto evaluate an inverse pth root of a given matrix is presented. the scheme is analyzedand its properties are investigated. computational experiments are also performedto illustrate the strengths and weaknesses of the proposed method.
similar resources
A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...
full textA stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
full textOn the Newton Method for the Matrix P th Root
We consider the Newton iteration for computing the principal matrix pth root, which is rarely used in the application for the bad convergence and the poor stability. We analyze the convergence conditions. In particular it is proved that the method converges for any matrix A having eigenvalues with modulus less than 1 and with positive real part. Based on these results we provide a general algor...
full textA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
full textINVERSE ITERATION FOR p-GROUND STATES
We adapt the inverse iteration method for symmetric matrices to some nonlinear PDE eigenvalue problems. In particular, for p ∈ (1,∞) and a given domain Ω ⊂ Rn, we analyze a scheme that allows us to approximate the smallest value the ratio ∫ Ω |Dψ| pdx/ ∫ Ω |ψ| pdx can assume for functions ψ that vanish on ∂Ω. The scheme in question also provides a natural way to approximate minimizing ψ. Our an...
full textA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
full textMy Resources
Save resource for easier access later
Journal title:
international journal of mathematical modelling and computationsجلد ۵، شماره ۱ (WINTER)، صفحات ۶۹-۷۹
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023